Computational complexity - PDFSEARCH.IO - Document Search Engine

Computational complexity
Results: 2253

#	Item
611	Chapter 2 Leader Election 2.1 Anonymous Leader Election Add to Reading List Source URL: dcg.ethz.ch Language: English - Date: 2014-09-26 08:28:48 Distributed data storage Analysis of algorithms Probabilistic complexity theory Randomized algorithm Distributed algorithm Graph coloring Leader election Distributed computing Consensus Theoretical computer science Mathematics Computational complexity theory
612	CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Privacy by Fake Data: A Geometric Approach Victor Alvarez∗ Erin Chambers† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2013-08-11 21:51:56 Complexity classes Structural complexity theory Mathematical optimization Approximation algorithms Ε-net NP Polynomial-time approximation scheme Reduction Packing problem Theoretical computer science Computational complexity theory Applied mathematics
613	Contention Resolution with Heterogeneous Job Sizes Michael A. Bender1 , Jeremy T. Fineman2 , and Seth Gilbert2 1 2 Add to Reading List Source URL: www.comp.nus.edu.sg Language: English - Date: 2007-09-28 06:20:20 Analysis of algorithms Operations research Computational complexity theory Ethernet Exponential backoff Search algorithms Job shop scheduling Binary logarithm Time complexity Theoretical computer science Mathematics Applied mathematics
614	Exploiting symmetries in logistics distribution planning Add to Reading List Source URL: www.mssanz.org.au Language: English - Date: 2013-01-15 22:34:44 NP-complete problems Analysis of algorithms Algorithm Mathematical logic Travelling salesman problem Logistics Symmetry in mathematics Time complexity Vehicle routing problem Theoretical computer science Computational complexity theory Applied mathematics
615	CCCG 2004, Montreal, Quebec, August 9–11, 2004 Separating points by axis-parallel lines Gruia C˘alinescu Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2004-08-23 15:27:23 Complexity classes NP-complete problems Combinatorial optimization Operations research Computational problems Linear programming relaxation APX NP-complete Boolean satisfiability problem Theoretical computer science Computational complexity theory Mathematics
616	zn poly: a library for polynomial arithmetic David Harvey, New York University January 8, 2009 David Harvey, New York University Add to Reading List Source URL: web.maths.unsw.edu.au Language: English - Date: 2011-07-17 23:06:27 Polynomials Computational number theory Computational complexity theory Algebra Digital signal processing Fast Fourier transform Fast Library for Number Theory Time complexity Multiplication Mathematics Abstract algebra Theoretical computer science
617	CCCG 2011, Toronto ON, August 10–12, 2011 Space-efficient Algorithms for Empty Space Recognition among a Point Set in 2D and 3D Minati De∗† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-06 04:11:13 Largest empty rectangle Algorithm Closest pair of points problem Reduction Computer science Computational geometry Beta skeleton Mathematics Applied mathematics Computational complexity theory
618	Richard Ryan Williams Computer Science Department Stanford University, Stanford, CAEmail: EDUCATION Add to Reading List Source URL: web.stanford.edu Language: English - Date: 2014-09-18 23:56:44 ACM SIGACT Symposium on Theory of Computing International Colloquium on Automata Languages and Programming Ryan Williams Symposium on Foundations of Computer Science Computational complexity theory SWAT and WADS conferences Algorithm Symposium on Parallelism in Algorithms and Architectures Theoretical computer science Computer science Applied mathematics
619	On the Theory of Average Case Complexity Shai Ben-Davidy Benny Chor Oded Goldreichz Michael Lubyx Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2014-06-22 06:24:22 Complexity classes Computability theory Mathematical optimization Structural complexity theory P versus NP problem NP-complete Turing reduction Decision problem Reduction Theoretical computer science Computational complexity theory Applied mathematics
620	Parameterized Complexity-News The Newsletter of the Parameterized Complexity Community Volume 1, MayWelcome Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-08-06 03:15:19 NP-complete problems Analysis of algorithms Parameterized complexity Kernelization Feedback vertex set Graph coloring Vertex cover Dominating set Time complexity Theoretical computer science Computational complexity theory Applied mathematics

UPDATE